Highly Discriminating Distance - Based Topological Index
نویسنده
چکیده
A new topological index J (based on distance sums s i as graph invariants) is proposed. For unsaturated or aromatic compounds, fractional bond orders are used in calculating s i. The degeneracy of J is lowest among all single topological indices described so far. The asymptotic behaviour of J is discussed, e.g. when n ~ ~ in CnH2n+2, J ~ ~r for linear alkanes, and J ~ ** for highly branched ones.
منابع مشابه
Topological Indices Based on Topological Distances in Molecular Graphs
Three new distance—based topological indices are described; two of them, D and D1 (mean distance topological indices, for any graphs, and for acyclic graphs, respectively) have a modest discriminating ability but may be useful for correlations, e. g. with octane numbers. The third index, J (average distance sum connectivity) is the least degenerate single topological index proposed till now. Th...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملSuperaugmented Pendentic Indices: Novel Topological Descriptors for QSAR/QSPR
Four pendenticity based topological descriptors termed as superaugmented pendentic indices have been conceptualized in the present study. An in-house computer program was utilized to compute index values of all the possible structures (with at least one pendent vertex) containing four, five and six vertices. The sensitivity towards branching, discriminating power, degeneracy and mathematical pr...
متن کاملNetwork analysis using a novel highly discriminating topological index
When characterizing networks structurally, the discriminating ability of a topological measure (or also called index) is crucial. This relates to investigate its discrimination power (or also called uniqueness or degeneracy) that indicates how meaningful the given measure can distinguish nonisomorphic networks. In terms of biological and chemical graph analysis, a highly discriminative measure ...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کامل